#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MOD = 1e5 + 3;

LL a, b, c, d, k;

LL f[2001], g[2001];

LL qpow(LL a, LL b, LL p)
{
	LL ans = 1;
	while(b)
	{
		if(b & 1) ans = ans * a % p;
		a = a * a % p;
		b >>= 1;
	}
	return ans;
}

void init()
{
	LL n = 2000;
	f[0] = 1;
	for(int i = 1;i <= n;i ++) f[i] = f[i - 1] * i % MOD;
	g[n] = qpow(f[n], MOD - 2, MOD);
	for(int i = n - 1;i >= 0;i --) g[i] = g[i + 1] * (i + 1) % MOD; 
}

LL C(LL n, LL m)
{
	if(n < m) return 0;
	return f[n] * g[m] % MOD * g[n - m] % MOD;
}

int main()
{
	cin >> a >> b >> c >> d >> k;
	init();
	LL ans = 0;
	for(LL x = 0;x <= k;x ++)
	{
		LL l = C(c, x) * C(d, x) % MOD * f[x] % MOD;
		LL r = C(a, k - x) * C(b + d - x, k - x) % MOD * f[k - x] % MOD;
		ans = (ans + l * r % MOD) % MOD;
	}
	cout << ans << endl;
	return 0;
}